An experimental study of VCG mechanism for multi-unit auctions: competing with machine bidders

نویسندگان

چکیده

This paper complements the main experimental result reported in Takahashi et al. (Evolut Inst Econ Rev 16:357–374, 2019) to a deeper understanding of subjects’ bidding behavior under VCG mechanism. In experiment, there are two types appearance information about bidders’ valuations item given them and bids they asked submit: one is unit themselves (Appearance 1) other multiplied by number units 2). For subjects who compete with truth-telling machine bidders multi-unit auctions, we confirmed that Appearance 1, choose more frequently, efficient allocations observed as compared situation where human bidders. suggests possibility learn their dominant strategy not practicing but experiments for although allocation payment determination mechanism never intuitively understandable subjects.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-unit Auctions with a Stochastic Number of Asymmetric Bidders

Existing work on auctions assumes that bidders are symmetric in their types — they have the same risk attitude and their valuations are drawn from the same distribution. This is unrealistic in many real-world applications, where highly heterogeneous bidders with different risk attitudes and widely varying valuation distributions commonly compete with each other. Using computational service auct...

متن کامل

Prior-Free Multi-Unit Auctions with Ordered Bidders∗

Prior-free auctions are robust auctions that assume no distribution over bidders’ valuations and provide worst-case (input-by-input) approximation guarantees. In contrast to previous work on this topic, we pursue good prior-free auctions with non-identical bidders. Prior-free auctions can approximate meaningful benchmarks for non-identical bidders only when sufficient qualitative information ab...

متن کامل

Equilibrium strategies for multi-unit sealed-bid auctions with multi-unit demand bidders

In most of the existing literature on multi-unit auctions, i.e. auctions selling several identical goods together, it is assumed that bidders demand a single item. Yet this assumption is not valid in most practical auction settings, as often bidders wish to purchase multiple goods. Computing equilibrium strategies in multi-unit uniform-price auctions for bidders with multi-unit demand is an ope...

متن کامل

An Approach to VCG-like Approximate Allocation and Pricing for Large-scale Multi-unit Combinatorial Auctions

A multi-unit combinatorial auction is a combinatorial auction that has some items that can be seen as indistinguishable. Although the mechanism can be applied to dynamic electricity auctions and various purposes, it is difficult to apply to large-scale auction problems due to its computational intractability. In this paper, I present an idea and an analysis about an approximate allocation and p...

متن کامل

Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders

Motivated by sponsored search auctions with hard budget constraints given by the advertisers, we study multi-unit auctions of a single item. An important example is a sponsored result slot for a keyword, with many units representing its inventory in a month, say. In this single-item multi-unit auction, each bidder has a private value for each unit, and a private budget which is the total amount...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Evolutionary and Institutional Economics Review

سال: 2021

ISSN: ['2188-2096', '1349-4961']

DOI: https://doi.org/10.1007/s40844-021-00198-1